0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : purification_ext
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-avatar \
0.00/0.00	  --ho \
0.00/0.00	  --force-ho \
0.00/0.00	  --no-ho-elim-pred-var \
0.00/0.00	  --ho-general-ext-pos \
0.00/0.00	  --no-ho-unif \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2  \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --ho-purify ext \
0.00/0.00	  --ho-ext-axiom \
0.00/0.00	  --restrict-hidden-sup-at-vars \
0.00/0.00	  --ho-prim-enum none \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --dont-select-ho-var-lits \
0.00/0.00	  --no-fool
0.00/0.20	% Computer   : n117.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 17:12:40 CST 2018
0.00/0.22	% done 8 iterations in 0.005s
0.00/0.22	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.22	% SZS output start Refutation
0.00/0.22	tff(subsetI1, axiom,
0.00/0.22	  (subsetI1 <=> (![A,B]: ((![Xx]: (in(Xx,A) => in(Xx,B))) => subset(A,B))))).
0.00/0.22	tff('0', plain,
0.00/0.22	    ![X0, X1]: (in(sk_Xx(X0, X1), X1) | subset(X1, X0) | ~ subsetI1),
0.00/0.22	    inference('cnf', [status(esa)], [subsetI1])).
0.00/0.22	tff(notequalI1, conjecture,
0.00/0.22	  (subsetI1 => (![A,B]: ((~subset(A,B)) => (A != B))))).
0.00/0.22	tff(zf_stmt_0, negated_conjecture,
0.00/0.22	  (~(subsetI1 => (![A,B]: ((~subset(A,B)) => (A != B)))))).
0.00/0.22	tff('1', plain, subsetI1, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('2', plain,
0.00/0.22	    ![X0, X1]: (in(sk_Xx(X0, X1), X1) | subset(X1, X0) | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.22	tff('3', plain, ![X0, X1]: (subset(X1, X0) | in(sk_Xx(X0, X1), X1)),
0.00/0.22	    inference('simplify', [status(thm)], ['2'])).
0.00/0.22	tff('4', plain,
0.00/0.22	    ![X0, X1]: (~ in(sk_Xx(X0, X1), X0) | subset(X1, X0) | ~ subsetI1),
0.00/0.22	    inference('cnf', [status(esa)], [subsetI1])).
0.00/0.22	tff('5', plain,
0.00/0.22	    ![X0, X1]: (~ in(sk_Xx(X0, X1), X0) | subset(X1, X0) | ~ $true),
0.00/0.22	    inference('demod', [status(thm)], ['4', '1'])).
0.00/0.22	tff('6', plain, ![X0, X1]: (subset(X1, X0) | ~ in(sk_Xx(X0, X1), X0)),
0.00/0.22	    inference('simplify', [status(thm)], ['5'])).
0.00/0.22	tff('7', plain, ![X0]: (~ $true | subset(X0, X0) | subset(X0, X0)),
0.00/0.22	    inference('sup-', [status(thm)], ['3', '6'])).
0.00/0.22	tff('8', plain, ![X0]: subset(X0, X0),
0.00/0.22	    inference('simplify', [status(thm)], ['7'])).
0.00/0.22	tff('9', plain, ~ subset(sk_A1, sk_B1),
0.00/0.22	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('10', plain, sk_A1 = sk_B1, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.22	tff('11', plain, ~ subset(sk_A1, sk_A1),
0.00/0.22	    inference('demod', [status(thm)], ['9', '10'])).
0.00/0.22	tff('12', plain, ~ $true, inference('sup-', [status(thm)], ['8', '11'])).
0.00/0.22	tff('13', plain, $false, inference('simplify', [status(thm)], ['12'])).
0.00/0.22	
0.00/0.22	% SZS output end Refutation
0.00/0.22	EOF
